Proof Methods in an Agenda-Based Natural-Deduction Theorem Prover
نویسنده
چکیده
This note describes several methods of finding proofs used in APRVR, an agenda-based, natural-deduction theorem prover. APRSR retains a complete tree of all pending or completed goals and is able to choose the next goal to be processed from an agenda of pending goals. Through this mechanism some proof methods can be utilized that had been unavailable to an earlier prover that was not agenda-based. One approach allows information discovered in one path in an attempted proof to trigger a case split in another part of the attempted proof (NONLOCAL CASE SPLIT). Another procedure enables better handling of splitting a conjunction (ANDSPLIT) by making it possible to use more information in determining which conjunct should be split off first.
منابع مشابه
Transforming Programs into Recursive Functions
This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the pr...
متن کاملNatural Proof Search and Proof Writing
Muscadet is a knowledge-based theorem prover based on natural deduction. Its results show its complementarity with regard to resolution-based provers. This paper presents some Muscadet results and points out some of its characteristics.
متن کاملProof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps∗
We present the certifying part of the Zenon Modulo automated theorem prover, which is an extension of the Zenon tableau-based first order automated theorem prover to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms i...
متن کاملStrong and weak points of the MUSCADET theorem prover - examples from CASC-JC
MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001).
متن کاملParsing as Natural Deduction
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing method. In natural language processing, the task of a parser usually consists in finding derivations for all different readings of a sentence. The original Lambek Calculus, when it is used as a parser / theorem prover, ...
متن کامل